Eigenvalues of non-regular linear quasirandom hypergraphs

Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to coregular k-uniform hypergraphs with loops. However, for k ≥ 3 no k-uniform hypergraph is coregular. In this paper we remove the coregular requirement. Consequently, the characterization can be applied to k-uniform hypergraphs; for example it is used in [19] to show that a construction of a k-uniform hypergraph sequence is quasirandom.